Deciding absorption
نویسندگان
چکیده
We characterize absorption in finite idempotent algebras by means of Jónsson absorption and cube term blockers. As an application we show that it is decidable whether a given subset is an absorbing subuniverse of an algebra given by the tables of its basic operations.
منابع مشابه
Ezetimibe plus a Statin after Acute Coronary Syndromes
To the Editor: With regard to the article by Cannon et al. (June 18 issue),1 human serum cholesterol derives from two sources: it is either synthesized endogenously or absorbed in the intestine. Statins inhibit endogenous cholesterol synthesis, whereas ezetimibe inhibits intestinal cholesterol absorption.2 According to findings from the Scandinavian Simvastatin Survival Study3 and the German Di...
متن کاملEzetimibe plus a Statin after Acute Coronary Syndromes.
To the Editor: With regard to the article by Cannon et al. (June 18 issue),1 human serum cholesterol derives from two sources: it is either synthesized endogenously or absorbed in the intestine. Statins inhibit endogenous cholesterol synthesis, whereas ezetimibe inhibits intestinal cholesterol absorption.2 According to findings from the Scandinavian Simvastatin Survival Study3 and the German Di...
متن کاملDeciding Graph non-Hamiltonicity via a Closure Algorithm
We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...
متن کاملAccess methods in nutritional support
The limiting factor in nutritional support of the vast majority of patients is the attainment and maintenance of safe access, whether it be to the venous system for total parenteral nutrition (TPN) or to the gut for enteral nutrition. Indeed, the mainstay of nutritional support therapy is deciding the appropriate route for nutritional support and obtaining access to provide that support. Centra...
متن کاملOn the complexity of $\mathbb H$-coloring for special oriented trees
For a fixed digraph H, the H-coloring problem is the problem of deciding whether a given input digraph G admits a homomorphism to H. The CSP dichotomy conjecture of Feder and Vardi is equivalent to proving that, for any H, the H-coloring problem is in in P or NP-complete. We confirm this dichotomy for a certain class of oriented trees, which we call special trees (generalizing earlier results o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 26 شماره
صفحات -
تاریخ انتشار 2016